A 2 Level Dynamic Scheduling Method for Real Time Tasks on Homogeneous Distributed System
نویسنده
چکیده
A distributed system is a collection of independent computers that appears to its users as a single coherent system. Depending on job arrival rate some of the computing nodes may become overloaded while some other nodes may sit idle. The imbalance in load distribution may affect overall system performance. So proper task scheduling algorithm is needed. Real time task scheduling algorithm must take deadline of a task in consideration. Task dependency is another parameter that is to be considered while scheduling. If arrival time of job is not known apriori, runtime scheduling is needed. The centralized scheduling schemes are not scalable as the scheduling decision is taken by a central server. Fully distributed schemes are scalable, but they lack global information. A hierarchical dynamic semi distributed scheduling model is proposed in this paper, taking deadline and dependency of each task in consideration. Index Terms Task scheduling, Clustered homogeneous distributed system, dynamic scheduling, real time task, DAG. __________________________________________________*****_________________________________________________
منابع مشابه
An Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملDynamic Real-Time Scheduling for OSEdelta
We deene a model for a distributed real-time transaction scheduler which will work on top of a real-time operating system like OSEdelta. The scheduler makes its scheduling decisions on the y (dynamic), works with multiple resources including the CPU (multi-dimensional), and it will handle tasks with diierent granularities of timing constraints such as hard, soft and rm deadlines (multi-level).
متن کاملAn application of principal component analysis and logistic regression to facilitate production scheduling decision support system: an automotive industry case
Production planning and control (PPC) systems have to deal with rising complexity and dynamics. The complexity of planning tasks is due to some existing multiple variables and dynamic factors derived from uncertainties surrounding the PPC. Although literatures on exact scheduling algorithms, simulation approaches, and heuristic methods are extensive in production planning, they seem to be ineff...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملDynamic Distributed Scheduling of Soft Real-Time Tasks
In distributed real-time systems the scheduler of an overloaded node may choose to transfer the execution of one or more of its tasks to other less busy nodes in order to improve the number of tasks that meet their deadlines. One solution uses Bayesian theory to infer the loading state of the system and, based on this information, the scheduler chooses an “adequate” node to transfer a task to. ...
متن کامل